Algorithms and Complexity for Continuous Problems

s in Alphabetical Order by Speaker’s Surname: Efficient Generation of Low Discrepancy Sequences Emanouil Atanassov joint work with Michael Mascagni 5 On the Power of Various Real-Valued Quantum Queries Arvid Bessen 5 Comparison of Three Algorithms for Finding All Vertices of a Polyhedron Based on a Probabilistic Analysis Karl Heinz Borgwardt 5 Convergence Rate for an Optimization Algorithm Under the 2-Fold Integrated Wiener Measure James M. Calvin 6 The Continuing Search for Lattice Rules: Exploiting Structured Matrices Ronald Cools and Hilde Govaert 6 Approximation of Gaussian Random Vectors Jakob Creutzig 7 Recent Results on Adaptive Wavelet Schemes for Operator Equations Stephan Dahlke 7 On Adaptive Inverse Estimation of Linear Functionals in Hilbert Scales Alexander Goldenshluger joint work with Sergei V. Pereverzev 8 Quantum Approximation of Sobolev Embeddings Stefan Heinrich 8 Is the Mandelbrot Set Computable? Peter Hertling 8 On the Global Error of Methods Based on Multiple Itô-Integrals Norbert Hofmann joint work with Thomas Müller–Gronbach 8 Quadratic Forms of Gaussian Vectors (Quadratic Approximations in Risk Measurement) Stefan Jaschke 9 Complexity of Nonlinear Two-Point Boundary-Value Problems Bolesław Kacewicz 9 QMC Methods for the Solution of Differential Equations with Multiple Delayed Arguments Reinhold F. Kainhofer joint work with Robert F. Tichy 9 Quasi-Monte Carlo Methods for Some Linear Algebra Problems. Convergence and Complexity Aneta Karaivanova joint work with Michael Mascagni 10 Stratification by Rank-1 Lattices Alexander Keller 10